Using genetic algorithms on service facilities layouts design

نویسندگان

  • Wei Shang
  • Maozhu Jin
  • Jie Wang
چکیده

Traditionally, the objective of a service facility layout problem is to minimize the material handling cost and optimize the physical spaces that support a productive activity of the service system. Service delivering interface has direct impact to the efficiency and effectiveness of service system in light of customer’s contact. Layout problem of service facilities has received little attention in the literature. Due to complexity and combination of the facility layout problems, the genetic algorithm is put forward that codifies a chromosome and uses a direct representation to assign the departments to the different branch areas, enables good solutions to be justified in real instances of the problem in tourist service centre. The solution is shown on a decision plan representing the graphic layout of the departments within the service facility. This application is highly flexible that the decision maker can accordingly define the departments’ number to be accommodated, facility sizes, segment sizes, and algorithm parameters to be added or simplified.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Genetic Algorithm For The Geometrically Constrained Site Layout Problem With Unequal-Size Facilities

Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the site layout problem with unequal-size and constrained facilities. The problem involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The problem is characterised b...

متن کامل

Robust inter and intra-cell layouts design model dealing with stochastic dynamic problems

In this paper, a novel quadratic assignment-based mathematical model is developed for concurrent design of robust inter and intra-cell layouts in dynamic stochastic environments of manufacturing systems. In the proposed model, in addition to considering time value of money, the product demands are presumed to be dependent normally distributed random variables with known expectation, variance, a...

متن کامل

A Unifying Data Framework for Facilities Design Algorithms

Currently, there exist many different representations and corresponding data structures for departments in facilities design algorithms. These data structures were developed independently and at different times to satisfy the specific needs of the various design algorithms. As a consequence, layouts generated by different facilities design algorithms are very difficult to compare and the algori...

متن کامل

Yard Crane Pools and Optimum Layouts for Storage Yards of Container Terminals

As more and more container terminals open up all over the world, competition for business is becoming very intense for container terminal operators. They are finding out that even to keep their existing Sea Line customers, they have to make them happy by offering higher quality service. The quality of service they can provide depends on their operating policies and the design of the terminal la...

متن کامل

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014